Uniform Mixing on Cayley Graphs
نویسندگان
چکیده
منابع مشابه
Uniform Mixing on Cayley Graphs
This thesis investigates uniform mixing on Cayley graphs over Z3. We apply Mullin’s results on Hamming quotients, and characterize the 2(d+2)-regular connected Cayley graphs over Z3 that admit uniform mixing at time 2π/9. We generalize Chan’s construction on the Hamming scheme H(d, 2) to the schemeH(d, 3), and find some distance graphs of the Hamming graph H(d, 3) that admit uniform mixing at t...
متن کاملBroadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs th...
متن کاملTree Spanners, Cayley Graphs, and Diametrically Uniform Graphs
In line with symmetrical graphs such as Cayley graphs and vertex transitive graphs, we introduce a new class of symmetrical graphs called diametrically uniform graphs. The class of diametrically uniform graphs includes vertex transitive graphs and hence Cayley graphs. A tree t-spanner of graph G is a spanning tree T in which the distance between every pair of vertices is at most t times their d...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6855